Discretization of Target Attributes for Subgroup Discovery
نویسندگان
چکیده
We describe an algorithm called TargetCluster for the discretization of continuous targets in subgroup discovery. The algorithm identifies patterns in the target data and uses them to select the discretization cutpoints. The algorithm has been implemented in a subgroup discovery method. Tests show that the discretization method likely leads to improved insight.
منابع مشابه
Experimental Comparison of Three Subgroup Discovery Algorithms: Analysing Brain Ischaemia Data
This paper presents experimental results of subgroup discovery algorithms SD, CN2-SD and Apriori-SD implemented in the Orange data mining software. The experimental comparison shows that algorithms perform quite differently on data discretized in different ways. From the experiments, performed in the brain ischemia domain, it is impossible to conclude which discretization is the most adequate f...
متن کاملSubgroup Discovery for Defect Prediction
Although there is extensive literature in software defect prediction techniques, machine learning approaches have yet to be fully explored and in particular, Subgroup Discovery (SD) techniques. SD algorithms aim to find subgroups of data that are statistically different given a property of interest [1,2]. SD lies between predictive (finding rules given historical data and a property of interest...
متن کاملInterval MULTIMOORA method with target values of attributes based on interval distance and preference degree: biomaterials selection
A target-based MADM method covers beneficial and non-beneficial attributes besides target values for some attributes. Such techniques are considered as the comprehensive forms of MADM approaches. Target-based MADM methods can also be used in traditional decision-making problems in which beneficial and non-beneficial attributes only exist. In many practical selection problems, some attributes ha...
متن کاملHierarchical Discretization of Continuous Attributes Using Dynamic Programming
The area of Knowledge discovery and Data mining is growing rapidly. A large number of methods are employed to mine knowledge. Several of the methods rely of discrete data. However, most datasets used in real application have attributes with continuous values. To make the data mining techniques useful for such datasets, discretization is performed as a pre-processing step. Discretization is a pr...
متن کاملAction Rules Discovery Based on Tree Classifiers and Meta-actions
Action rules describe possible transitions of objects from one state to another with respect to a distinguished attribute. Early research on action rule discovery usually required the extraction of classification rules before constructing any action rule. Newest algorithms discover action rules directly from a decision system. To our knowledge, all these algorithms assume that all attributes ar...
متن کامل